package com.example.leetcode.dp;

import com.example.leetcode.dp.common.DPUtils;

class Solution931 {
    public int minFallingPathSum(int[][] matrix) {
        return DPUtils.minFallingPathSum(matrix);
    }
}

public class leetcode931 {
    public static void main(String[] args) {
        Solution931 solution931 = new Solution931();
        int[][] matrix = {{2, 1, 3}, {6, 5, 4}, {7, 8, 9}};
        System.out.println(solution931.minFallingPathSum(matrix));
    }
}
